Technical Report: Estimating Reliability of Workers for Cooperative Distributed Computing

Internet supercomputing is an approach to solving partitionable, computation-intensive problems by harnessing the power of a vast number of interconnected computers. For the problem of using network supercomputing to perform a large collection of independent tasks, prior work introduced a decentralized approach and provided randomized synchronous algorithms that perform all tasks correctly with high probability, while dealing with misbehaving or crash-prone processors. The main weaknesses of existing algorithms is that they assume either that the average probability of a non-crashed processor returning incorrect results is inferior to 1 2 , or that the probability of returning incorrect results is known to each processor. Here we present a randomized synchronous distributed algorithm that tightly estimates the probability of each processor returning correct results. Starting with the set P of n processors, let F be the set of processors that crash. Our algorithm estimates the probability pi of returning a correct result for each processor i ∈ P − F , making the estimates available to all these processors. The estimation is based on the (ε, δ)-approximation, where each estimated probability p̃i of pi obeys the bound Pr[pi(1 − ε) ≤ p̃i ≤ pi(1 + ε)] > 1 − δ, for any constants δ > 0 and ε > 0 chosen by the user. An important aspect of this algorithm is that each processor terminates without global coordination. We assess the efficiency of the algorithm in three adversarial models as follows. For the model where the number of non-crashed processors |P −F | is linearly bounded the time complexity T (n) of the algorithm is Θ(log n), work complexity W (n) is Θ(n log n), and message complexity M(n) is Θ(n log n). For the model where |P−F | is bounded by a fractional polynomial (|P − F | = Ω(n), for a constant a ∈ (0, 1)) we have T (n) = O(n1−a log n log log n), W (n) = O(n log n log log n), and M(n) = O(n log n). For the model where |P − F | is bounded by a poly-logarithm we have T (n) = O(n), W (n) = O(n), and M(n) = O(n). All bounds are shown to hold with high probability.